A Bernstein Theorem for Special Lagrangian Graphs

نویسندگان

  • Jürgen Jost
  • Y L Xin
چکیده

We obtain a Bernstein theorem for special Lagrangian graphs in Cn = R for arbitrary n only assuming bounded slope but no quantitative restriction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bernstein Type Theorems For Minimal Lagrangian Graphs of Quaternion Euclidean space

In this paper, we prove some Bernstein type results for n-dimensional minimal Lagrangian graphs in quaternion Euclidean space Hn ∼= R. In particular, we also get a new Bernstein Theorem for special Lagrangian graphs in Cn.

متن کامل

Bernstein Type Results for Lagrangian Graphs with Partially Harmonic Gauss Map

We establish Bernstein Theorems for Lagrangian graphs which are Hamiltonian minimal or have conformal Maslov form. Some known results of minimal (Lagrangian) submanifolds are generalized.

متن کامل

Lagrangian Mean Curvature Flow for Entire Lipschitz Graphs

We consider the mean curvature flow of entire Lagrangian graphs with Lipschitz continuous initial data. Assuming only a certain bound on the Lipschitz norm of an initial entire Lagrangian graph in R, we show that the parabolic equation (1.1) has a longtime solution which is smooth for all positive time and satisfies uniform estimates away from time t = 0. In particular, under the mean curvature...

متن کامل

A Bernstein Type Result for Special Lagrangian Submanifolds

The well-known Bernstein theorem states any complete minimal surface that can be written as the graph of a function on R must be a plane. This type of result has been generalized in higher dimension and codimension under various conditions. See [2] and the reference therein for the codimension one case and [1], [3], and [6] for higher codimension case. In this note, we prove a Bernstein type re...

متن کامل

An Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs

First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008